Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture
نویسندگان
چکیده
The Andrews-Curtis conjecture states that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of the elementary Nielsen transformations and conjugations. In this paper we describe all balanced presentations of the trivial group on two generators and with the total length of relators ≤ 12. We show that all these presentations satisfy the Andrews-Curtis conjecture. 1991 Mathematics Subject Classification: Primary 20E05, 20F05, 68T05; Secondary 57M05, 57M20. This research was partially supported by the NSF, grant DMS-9973233.
منابع مشابه
On the Andrews-Curtis equivalence
The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of \elementary transformations" which are Nielsen transformations augmented by arbitrary conjugations. It is a prevalent opinion that this conjecture is false; however, not many potential counterexamples are known. In this paper, we show that some of the pr...
متن کاملGenetic algorithms and the Andrews-Curtis conjecture
The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be transformed into the trivial presentation by a finite sequence of “elementary transformations” which are Nielsen transformations together with an arbitrary conjugation of a relator. It is believed that the Andrews-Curtis conjecture is false; however, not so many possible counterexamples are known. ...
متن کاملOn Rourke’s Extension of Group Presentations and a Cyclic Version of the Andrews–curtis Conjecture
In 1979, Rourke proposed to extend the set of cyclically reduced defining words of a group presentation P by using operations of cyclic permutation, inversion and taking double products. He proved that iterations of these operations yield all cyclically reduced words of the normal closure of defining words of P if the group, defined by the presentation P, is trivial. We generalize this result b...
متن کاملAndrews-Curtis and Todd-Coxeter proof words
Andrews and Curtis have conjectured that every balanced presentation of the trivial group can be transformed into a standard presentation by a finite sequence of elementary transformations. It can be difficult to determine whether or not the conjecture holds for a particular presentation. We show that the utility PEACE, which produces proofs based on Todd-Coxeter coset enumeration, can produce ...
متن کاملFirst-order theorem proving in the exploration of Andrews-Curtis conjecture
Proving or disproving the Andrews-Curtis conjecture remains one of the outstanding open problems in combinatorial group theory. In short, it states that every balanced presentation of the trivial group can be transformed (aka. AC-simplified) into a trivial presentation by a sequence of Nielsen transformations on the relators together with conjugations of relators. It is believed that the conjec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره math.GR/0304305 شماره
صفحات -
تاریخ انتشار 2000